πŸ‘©β€πŸ’» 92344. νŒŒκ΄΄λ˜μ§€ μ•Šμ€ 건물

@Seongukbaek Posted July 17, 2022 Β· Updated July 17, 2022 Β· 3 min read

문제

Programmers - νŒŒκ΄΄λ˜μ§€ μ•Šμ€ 건물

πŸ“ Logic

private void fill(int r1, int c1, int r2, int c2, int deg) { attackOrHeal[r1][c1] += deg; if (c2 + 1 < cSize) attackOrHeal[r1][c2 + 1] += -deg; if (r2 + 1 < rSize) attackOrHeal[r2 + 1][c1] += -deg; if (r2 + 1 < rSize && c2 + 1 < cSize) attackOrHeal[r2 + 1][c2 + 1] += deg; }
  • μ£Όμ–΄μ§„ λ²”μœ„μ˜ λˆ„μ ν•© 계산을 μœ„ν•΄ λ²”μœ„ λ‚΄μ˜ λ°°μ—΄ 값을 λˆ„μ ν•©ν•˜λŠ” ν•¨μˆ˜

πŸ“„ CODE

μ½”λ“œ 보기/μ ‘κΈ°πŸ’«
class Solution { static int[][] attackOrHeal; static int[][] board; static int rSize; static int cSize; public int solution(int[][] board, int[][] skill) { this.board = board; this.rSize = board.length; this.cSize = board[0].length; attackOrHeal = new int[rSize][cSize]; for (int[] sk : skill) { boolean attack = sk[0] == 1; int r1 = sk[1]; int c1 = sk[2]; int r2 = sk[3]; int c2 = sk[4]; int deg = sk[5]; if (attack) fill(r1, c1, r2, c2, -deg); else fill(r1, c1, r2, c2, deg); } accumulate(); return countUndestroyedBuildings(); } // 각 열별 였λ₯Έμͺ½ λˆ„μ ν•©, 각 행별 μ•„λž˜μͺ½ λˆ„μ ν•© 계산 private void accumulate() { for (int i = 0; i < rSize; i++) for (int j = 1; j < cSize; j++) attackOrHeal[i][j] += attackOrHeal[i][j - 1]; for (int i = 1; i < rSize; i++) for (int j = 0; j < cSize; j++) attackOrHeal[i][j] += attackOrHeal[i - 1][j]; } // λˆ„μ ν•© λ°°μ—΄κ³Ό boardλ₯Ό κ³„μ‚°ν•˜μ—¬ 내ꡬ도가 0보닀 큰 건물 카운트 private int countUndestroyedBuildings() { int count = 0; for (int i = 0; i < rSize; i++) for (int j = 0; j < cSize; j++) if (board[i][j] + attackOrHeal[i][j] > 0) count++; return count; } // μ‹œκ°„ λ³΅μž‘λ„λ₯Ό 쀄이기 μœ„ν•΄ λˆ„μ ν•©μ„ μ‚¬μš©ν•˜λŠ”λ°, 이λ₯Ό μœ„ν•΄ ν•„μš”ν•œ λ°°μ—΄ λ²”μœ„μ˜ κ°’ μ±„μš°κΈ° private void fill(int r1, int c1, int r2, int c2, int deg) { attackOrHeal[r1][c1] += deg; if (c2 + 1 < cSize) attackOrHeal[r1][c2 + 1] += -deg; if (r2 + 1 < rSize) attackOrHeal[r2 + 1][c1] += -deg; if (r2 + 1 < rSize && c2 + 1 < cSize) attackOrHeal[r2 + 1][c2 + 1] += deg; } }

✏️ Review

  • μ²˜μŒμ—λŠ” skill 값을 λ‹€ 읽고 μ΅œμ’…μ μœΌλ‘œ board 에 증감할 값을 λ§Œλ“€μ–΄λ‘κ³  0보닀 큰 경우의 개수λ₯Ό μ„ΈλŠ” λ°©μ‹μœΌλ‘œ κ΅¬ν˜„ν–ˆλŠ”λ° λ‹Ήμ—°νžˆλ„ μ‹œκ°„ μ΄ˆκ³Όκ°€ 났닀.
  • μ—¬κΈ°μ„œ 더 이상 μ‹œκ°„μ„ 쀄일 방법을 λͺ¨λ₯΄κ² μ–΄μ„œ 카카였 풀이λ₯Ό μ°Έκ³ ν–ˆλ‹€. λ­”κ°€ λΉ„μŠ·ν•œ λŠλ‚Œμ΄κΈ΄ ν•œλ°, λˆ„μ ν•© 배열을 μ‚¬μš©ν•΄ μ‹œκ°„λ³΅μž‘λ„λ₯Ό 쀄일 수 μžˆμ—ˆλ‹€..

    • 그치만 이런 ν’€μ΄λŠ” λˆ„μ ν•© 문제λ₯Ό κ°€μ§€κ³  놀 정도가 λ˜μ–΄μ•Ό λ– μ˜€λ₯Ό 것 κ°™λ‹€....
@Seongukbaek
배우고 μ •λ¦¬ν•˜κ³  κ³΅μœ ν•˜λŠ” λŒ€ν•™μƒ λ°±μ„±μš±μž…λ‹ˆλ‹€ πŸ˜€